Clique problem

Results: 134



#Item
31260  Genome Informatics 16(2): 260–Interaction Graph Mining for Protein Complexes Using Local Clique Merging

260 Genome Informatics 16(2): 260–Interaction Graph Mining for Protein Complexes Using Local Clique Merging

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2005-12-28 06:18:58
32An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem Takeaki Uno National Institute of Informatics 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan,

An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem Takeaki Uno National Institute of Informatics 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan,

Add to Reading List

Source URL: research.nii.ac.jp

Language: English - Date: 2010-09-24 01:42:12
    33The K-clique Densest Subgraph Problem Charalampos E. Tsourakakis Harvard School of Engineering and Applied Sciences

    The K-clique Densest Subgraph Problem Charalampos E. Tsourakakis Harvard School of Engineering and Applied Sciences

    Add to Reading List

    Source URL: www.www2015.it

    Language: English - Date: 2015-05-15 11:16:55
      34Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany

      Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany

      Add to Reading List

      Source URL: fpt.akt.tu-berlin.de

      Language: English - Date: 2015-06-25 05:19:55
      35GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida

      GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida

      Add to Reading List

      Source URL: crcv.ucf.edu

      Language: English - Date: 2015-04-13 12:15:56
      36LNCSCircle of Friend Query in Geo-Social Networks

      LNCSCircle of Friend Query in Geo-Social Networks

      Add to Reading List

      Source URL: www.cse.unt.edu

      Language: English - Date: 2013-08-12 15:35:49
      37Poster: Spotting Suspicious Reviews via (Quasi-)clique Extraction Paras Jain, Shang-Tse Chen, Mozhgan Azimpourkivi† , Duen Horng Chau, Bogdan Carbunar† Georgia Tech, † Florida International University {paras, schen

      Poster: Spotting Suspicious Reviews via (Quasi-)clique Extraction Paras Jain, Shang-Tse Chen, Mozhgan Azimpourkivi† , Duen Horng Chau, Bogdan Carbunar† Georgia Tech, † Florida International University {paras, schen

      Add to Reading List

      Source URL: www.ieee-security.org

      Language: English - Date: 2015-05-11 16:42:39
      38An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1  2

      An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2

      Add to Reading List

      Source URL: www.tiberiocaetano.com

      Language: English - Date: 2008-05-10 06:35:04
      39CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

      CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

      Add to Reading List

      Source URL: stanford.edu

      Language: English - Date: 2015-03-23 01:42:07
      40Discrete Applied Mathematics–49  Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic

      Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic

      Add to Reading List

      Source URL: www.dais.unive.it

      Language: English - Date: 2002-12-03 08:21:13